Virtual Backbone Formation in Wireless Ad Hoc Networks
نویسنده
چکیده
Virtual Backbone Formation in Wireless Ad Hoc Networks
منابع مشابه
On the Scope of Backbone Formation in Wireless Ad Hoc Networks ¬リニ
Message efficiency is a prime concern in wireless computing because the nodes are resource constrained, failure prone, and sometimes mobile too. Over the years, the backbone construction has emerged as a powerful approach to achieve message efficiency and handle mobility in ad hoc wireless networks. In the existing literature, most popular techniques for virtual backbone formation are connected...
متن کاملEnergy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization
Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...
متن کاملA Performance Comparison of Virtual Backbone Formation Algorithms for Wireless Mesh Networks
Currently wireless networks are dominant by star topology paradigm. Its natural the evolution is towards wireless mesh multi-hop networks. This article compares the performance of several algorithms for virtual backbone formation in ad hoc mesh networks both theoretically and through simulations. Firstly, an overview of the algorithms is given. Next, the results of the algorithm simulations mad...
متن کاملEnergy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization
Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...
متن کاملSolving Connected Dominating Set Problem in Unit Disk Graphs by Genetic Algorithms
In this paper, we use Genetic Algorithms to find the Minimum Connected Dominating Set (MCDS) of Unit Disk Graphs (UDG). UDGs are used for modeling ad-hoc networks and finding MCDS in such graphs is a promising approach to construct an efficient virtual backbone in wireless ad-hoc networks. The MCDS problem is proved to be NP-complete. The simulation results show that the proposed algorithm outp...
متن کامل